Execution process of binary code of function secured by microprocessor

ABSTRACT

A method including the loading into registers of a microprocessor of a code line recorded at an address @j, and then calculating, with a securing hardware module, an initialization vector with the aid of a relation ivj=Fiv(@j), where @j is the address from which the code line was loaded, and then decrypting, with the securing hardware module, the code line loaded with the aid of the initialization vector calculated to obtain: a datum Dj of its cryptogram, and a first error-detecting code, and then verifying, with the securing hardware module and with the aid of the first error-detecting code obtained, whether there exists an error in the datum Dj or its cryptogram and, if such an error exists, triggering the signalling of an execution fault and, if such an error does not exist, inhibiting this signalling of an execution fault.

The invention relates to a method of execution of a binary code of a secure function by a microprocessor. The invention also relates to:

-   -   a binary code of a secure function, an information recording         medium and a microprocessor for the implementation of this         method of execution, and     -   a compiler for generating this binary code.

To obtain information on a binary code or to cause the binary code to operate in an unexpected manner, numerous attacks are possible. For example, attacks known by the term “fault injection” or “fault attack” can be implemented. These attacks consist in disturbing the functioning of the microprocessor or of the memory containing the binary code, by diverse physical means such as modifications of the supply voltages, modifications of the clock signal, exposure of the microprocessor to electromagnetic waves and others.

With the aid of such attacks, an attacker can alter the integrity of the machine instructions or of the data so as to, for example, retrieve a secret key of a cryptographic system, circumvent security mechanisms such as the verification of a PIN code during an authentication or simply prevent the execution of a function essential to the security of a critical system.

These attacks can in particular cause three types of faults, termed execution faults, during the execution of the binary code:

-   -   1) an alteration of the instructions of the executed machine         code,     -   2) an alteration of the data stored in the main memory or in         registers of the microprocessor, and     -   3) an alteration of the machine code control flow.

The control flow corresponds to the execution path followed during the execution of the machine code. The control flow is conventionally represented in the form of a graph known by the term control flow graph.

The binary code of a function can be instrumented to allow the detection and the signalling of execution faults. When the binary code of a function is thus instrumented, this binary code is referred to as “binary code of a secure function”. Indeed, in contradistinction to the binary code of a non-secure function, this binary code is able to allow the signalling of execution faults typically encountered in case of attacks.

Prior art is known from:

-   -   US2003/046563A1,     -   U.S. Pat. No. 7,058,877B2,     -   EP 1783648A1,     -   FR2841015A1.

In particular, US25003/046563A1 describes a binary code divided into instruction blocks, each encrypted with a different key. In this context, this document teaches that to prevent instruction blocks from being reversed in memory, it is necessary to encrypt each of these blocks with a key which depends on the memory address where this block is recorded. Moreover, this document teaches that after having been decrypted, the integrity of the block is verified. Accordingly, a checksum is calculated for the decrypted block. The expected values of the checksums are recorded in a section of the random-access memory different from that where the encrypted blocks are recorded.

The objective here is to propose a method for executing a binary code of a secure function which offers at least one of the following possibilities:

-   -   detecting an execution fault if an instruction of the machine         code of the secure function is altered,     -   detecting an execution fault if the control flow is altered,     -   detecting an execution fault in case of malfunction of an         arithmetic and logic unit during the execution of an instruction         by this unit,     -   detecting an execution fault if the data processed during the         execution of the secure function are altered.

The subject of the invention is therefore such a method of execution of a binary code of a secure function by a microprocessor in accordance with Claim 1.

The embodiments of this method of execution can comprise one or more of the characteristics of the dependent claims.

The subject of the invention is also a binary code of a secure function executable by a microprocessor for the implementation of the claimed method.

The subject of the invention is also an information recording medium readable by a microprocessor, this information recording medium containing the claimed binary code.

The subject of the invention is also a microprocessor for the implementation of the claimed method.

Finally, the subject of the invention is also a compiler able to automatically transform a source code of a secure function into a binary code of this secure function, in which the compiler is able to automatically transform the source code into a claimed binary code.

The invention will be better understood on reading the description which follows, given solely by way of nonlimiting example and while referring to the drawings in which:

FIG. 1 is a schematic illustration of the architecture of an electronic apparatus able to execute a binary code of a secure function;

FIG. 2 is a schematic illustration of the structure of a code line coding an instruction of the binary code executed by the apparatus of FIG. 1,

FIGS. 3 to 5 are schematic illustrations of various portions of the binary code of the secure function which is executable by the apparatus of FIG. 1;

FIG. 6 is a flowchart of a method of execution of the binary code of the secure function;

FIG. 7 is a schematic illustration of the structure of a register of the microprocessor of the apparatus of FIG. 1,

FIG. 8 is a flowchart of a detail of a step of the method of FIG. 6 implemented to secure the functioning of an arithmetic and logic unit of the microprocessor of the apparatus of FIG. 1,

FIG. 9 is a schematic illustration of the structure of a code line coding a datum processed during the execution of the binary code by the apparatus of FIG. 1,

FIG. 10 is a flowchart of a detail of a step of the method of FIG. 6 implemented to secure the data processed during the execution of the binary code by the apparatus of FIG. 1,

FIG. 11 is a schematic illustration of a compiler able to generate the machine code executed by the apparatus of FIG. 1.

CHAPTER I: CONVENTIONS, NOTATIONS AND DEFINITIONS

In the figures, the same references are used to designate the same elements. Hereinafter in this description, the characteristics and functions that are well known to the person skilled in the art are not described in detail.

In this description, the following definitions are adopted.

A “program” designates a set of one or more predetermined functions that one wishes to be executed by a microprocessor.

A “source code” is a representation of the program in a computer language, not being directly executable by a microprocessor and being intended to be transformed by a compiler into a machine code directly executable by the microprocessor.

A program or a code is said to be “directly executable” when it is able to be executed by a microprocessor without any prior need for this microprocessor to compile it by means of a compiler or to interpret it by means of an interpreter.

An “instruction” designates a machine instruction executable by a microprocessor. Such an instruction consists:

-   -   of an opcode, or operation code, coding the nature of the         operation to be executed, and     -   of one or more operands defining the value or values of the         parameters f this operation.

A “machine code” is a set of machine instructions. It typically entails a file containing a succession of bits bearing the value “0” or “1”, these bits coding the instructions to be executed by the microprocessor. The machine code is directly executable by the microprocessor, that is to say without requiring prior compilation or interpretation;.

A “binary code” is a file containing a succession, of bits bearing the value “0” or “1”. These bits code data and instructions to be executed by the microprocessor. Thus, the binary code comprises at least one machine code and in addition, generally, digital data processed by this machine code.

A “flow of instructions” is a succession of instructions ranked one after another and which forms, in the machine code, an ordered string of bits. The flow of instructions starts with an initial instruction and terminates with a final instruction. With respect to a given instruction of the flow of instructions, the instructions situated on the side of the initial instruction are called “preceding instructions” and the instructions situated on the side of the final instruction are called “following instructions”. In this text, this flow of instructions in memory is split up into a succession of base blocks that are immediately consecutive or are separated by data blocks.

In this text, a “base block” is a group of successive instructions of the flow of instructions which starts at a branching address and which terminates with a single explicit or implicit branching instruction. An explicit branching instruction is characterized by the explicit presence of an opcode in the machine code which codes the branching instruction. An implicit branching instruction corresponds to the case where the execution of a preceding base block continues systematically via the execution of a following base block situated, in the machine code, immediately after the preceding base block. In this case, given that in the absence of any explicit branching instruction, the instructions of the machine code are executed in order one after another, it is not necessary to introduce at the end of the preceding base block an explicit instruction for branching to the following base block. In this description, it is said that in this case, the preceding base block terminates with an implicit branching instruction since it is not explicitly coded in the machine code. In this case, the preceding base block terminates just before the branching address of the following base block. In this patent application, the expression “branching instruction” designates an explicit branching instruction unless stated to the contrary. Thus, the execution of a base block starts systematically with the execution of the instruction situated at its branching address and terminates systematically with the execution of the branching instruction which terminates this base block. A base block does not comprise any branching instructions other than that situated at the end of this base block. Thus, the instructions of a base block are systematically all read by the microprocessor one after another in the order in which they are present in this base block. The branching instruction can direct, when it is executed, the control flow systematically to the same branching address or, alternately, to various branching addresses. The latter typical case is encountered, for example, when at the end of the base block executed, the control flow can continue towards a first and, alternately, towards a second base block.

A “branching instruction” is an instruction which, when it is executed by the microprocessor, triggers a jump to, the branching address of another base block. This branching instruction therefore comprises at least the branching address of this other base block. Typically, for this purpose, this instruction replaces the current value of the ordinal counter by the value of the branching address. It is recalled that the ordinal counter contains the address of the next instruction to be executed by the microprocessor. In the absence of any branching instruction, each time an instruction is executed, the ordinal counter is incremented by the size of the currently executed instruction. In the absence of any branching instruction, the instructions are systematically executed sequentially one after another in the order in which they are recorded in a main memory. The branching instruction can be unconditional, that is to say that the jump to the branching address is systematically carried out as soon as this instruction is executed. An unconditional branching instruction is for example the “JMP” instruction in assembler language for the microprocessors of the x86 series. The branching instruction can also be conditional, that is to say that the jump to the branching address is triggered during its execution only if a particular condition is satisfied. For example, a conditional branching instruction is a “JE” “JA” or “JNE” instruction in assembler. The branching instruction can equally well be a call to a function. In this text, the term “branching instruction” designates equally well direct and indirect branching instructions. A direct branching instruction is a branching instruction which directly contains the numerical value of the branching address. An indirect branching instruction is an instruction for branching to a branching address contained in a memory or a register of the microprocessor. Thus, in contradistinction to a direct branching instruction, an indirect branching instruction does not directly contain the numerical value of the branching address.

A “branching address” is the address in the main memory at which the first executed instruction of a base block is situated. Hereinafter, one speaks of branching address even for the base blocks whose first instruction is executed subsequent to the execution of an implicit branching instruction.

One speaks of execution of a function to designate the execution of the instructions carrying out this function.

For the sake of simplification, in this description and in the figures, the instructions are not represented in binary form, but rather in a symbolic form expressed in a higher level advanced language.

Chapter II: Architecture of the Apparatus:

FIG. 1 represents an electronic apparatus 1 comprising a microprocessor 2, a main memory 4 and a mass storage medium 6. For example, the apparatus 1 is a computer, a smartphone, an electronic tablet or the like.

The microprocessor 2 comprises here:

-   -   an arithmetic and logic unit 10;     -   a set 12 of registers;     -   a control module 14;     -   a data input/output interface 16,     -   a loader 18 of instructions comprising an ordinal counter 26,     -   a queue 22 of instructions to be executed, and     -   a securing hardware module 28.

The memory 4 is configured to store instructions of a binary code 30 of a program having to be executed by the microprocessor 2. The memory 4 is a random access memory. Typically, the memory 4 is a volatile memory. The memory 4 can be a memory external to the microprocessor 2 as represented in FIG. 1. In this case, the memory 4 is embodied on a substrate mechanically separate from the substrate on which the various elements of the microprocessor 2, such as the unit 10, are embodied.

Here, the memory 4 is divided into successive machine words of fixed length. Each machine word can be transferred in a single dock cycle from the memory 4 into a register of the microprocessor. For this purpose, the size N_(MM) of a machine word is equal to the maximum number of bits which can be transferred simultaneously from the memory 4 to a register of the set 12. Here, the size N_(MM) is strictly greater than N_(inst) bits, where N_(inst) bits is the number of bits of the instructions of the instruction set of the microprocessor 2. Typically, N_(inst) is an integer greater than or equal to 8, 16, 32 or 64. In this example, N_(inst) is equal to 32 and the size N_(MM) is equal to 128 bits.

By way of illustration, the binary code 30 comprises in particular a machine code 32 of a secure function and a block 34 of data necessary for the decryption of the binary code 30. Each secure function corresponds to a set of several code lines, for example several hundreds or thousands of code lines, recorded at successive addresses in the memory 4. Here, each code line corresponds to a machine word. Thus, a code line is loaded into a register of the microprocessor 12 in a single reading operation. Likewise, a code line is written into the memory 4 by the microprocessor 2 in a single writing operation. Each code line codes either a single instruction or a single datum. The structure of a code line of the secure functions is described in detail with reference to FIGS. 2 and 9.

The block 34 is typically situated in a predetermined range of addresses at the start of the binary code 30. Thus, the execution of the binary code 30 starts with the loading and the processing of the data of the block 34. Here, the block 34 comprises in particular:

-   -   a cryptogram ka* obtained by encrypting a key ka with the aid of         a public key pk_(CPU) of the microprocessor 2,     -   the cryptogram iv_(ini)* obtained by encrypting, with the aid of         the public key pk_(CPU), an initialization vector iv_(ini) used,         to encrypt the first base block with which the execution of the         machine code 32 starts systematically,     -   a signature S_(ka*), of the cryptogram ka*, obtained by         encrypting a label, constructed on the basis of the cryptogram         ka*, with the aid of a private key sk_(aut) of an author of the         binary code 30,     -   a cryptographic certificate C_(aut) which makes it possible to         verify the signature S_(ka*), this certificate being signed with         the aid of a private key sk_(os) of an operating system and         containing a public key pk_(aut) which makes it possible to         verify the authenticity of the signature S_(ka*).

The label of the cryptogram ka* is typically obtained by applying a predetermined hash function to the cryptogram ka*. Such a label is better known by the term “digest”.

By way of illustration, the microprocessor 2 complies with the RISC (“Reduced Instructions Set Computer”) architecture.

Here, the unit 10 is an arithmetic and logic unit of N_(inst) bits.

The loader 18 loads into the queue 22 the next instruction to be executed by the unit 10 from the memory 4. More precisely, the loader 18 loads the instruction pointed at by the ordinal counter 26. In this embodiment, the loader 18 loads an 20 instruction I_(j) and an error-correcting code ECC_(Ij) into the queue 22 systematically and each time. The code ECC_(Ij) is coded on N_(ECCIj) bits, where N_(ECCIj) is an integer number often strictly less than N_(inst) and, generally, greater than 1 or 2 or 3 bits. For this purpose, the queue 22 comprises a succession of several registers each of width equal to N_(ECCIj)+N_(inst) bits.

The unit 10 is in particular configured to execute one after another the instructions loaded into the queue 22. The instructions loaded into the queue 22 are generally executed systematically in the order in which these instructions were recorded in this queue 22. The unit 10 is also capable of recording the result of these instructions executed in one or more of the registers of the set 12.

In this description, “execution by the microprocessor 2” and “execution by the unit 10” will be used as synonyms.

The module 14 is configured to move data between the set 12 of registers and the interface 16. The interface 16 is in particular able to acquire data and instructions, for example, from the external memory 4 and/or the medium 6 external to the microprocessor 2.

The module 28 is capable of automatically executing the various operations described in detail in the following chapters so as to secure the execution of the secure functions. The module 28 operates independently and without using the unit 10. Thus, it is capable of processing the code lines before and/or after the latter are processed by the unit 10. For this purpose, it comprises in particular a secure non-volatile memory 29. There is no provision for access to this memory 29 without passing by way of, the module 28. In this embodiment, the module 28 is preprogrammed, for example during its design, to execute operations such as the following operations:

-   -   verifying an error-correcting code and correcting the error on         the basis of this code if necessary,     -   verifying an error-detecting code,     -   constructing an error-detecting or -correcting code on the basis         of a datum,     -   verifying the integrity and the authenticity of a datum on the         basis of a message authentication code better known by the         acronym MAC (“Message Authentication Code”),     -   encrypting a datum to obtain a cryptogram,     -   decrypting a cryptogram to obtain a plaintext datum,     -   verifying a cryptographic signature and/or a cryptographic         certificate,     -   executing a preprogrammed function F_(iv).

The memory 29 is used to store the secret information necessary for the implementation of the method of FIG. 6. Here, said memory therefore comprises, in particular, secret information prerecorded before the start of the execution of the binary code 30. In particular, it comprises the following prerecorded information:

-   -   a secret key k′ used for the verifications of the message         authentication codes,     -   a cryptographic certificate C_(os) issued by a trusted authority         and comprising a public key pk_(os) of this trusted authority,     -   a cryptographic certificate C_(CPU) which is signed by the         trusted authority with the aid of a private key sk_(os) which         makes it possible to encrypt data which must be decrypted with         the aid of the public key pk_(OS), this certificate containing a         public key pk_(CPU),     -   a secret private key sk_(CPU) which makes it possible to decrypt         the data which have been encrypted with the aid of the public         key pk_(CPU).

In this exemplary embodiment, the set 12 comprises general registers usable to store any type of data. The size of each of these registers is, for example, equal to N_(MM).

A data exchange bus 24 which inter-links the various components of the microprocessor 2 is represented in FIG. 1 to indicate that the various components of the microprocessor can exchange data between themselves.

The medium 6 is typically a nonvolatile memory. For example, it is a memory of the EEPROM or Flash type. It contains here a backup copy 40 of the binary code 30. Typically, it is this copy 40 which is automatically copied over into the memory 4 to restore the code 30, for example, after a current outage or the like or just before the start of execution of the code 30.

Chapter III: Securing of the Machine Code:

Here, the structure of the machine code of the secure function is described in the particular case of the machine code 32. However, what is described in this particular case carries over without difficulty to any machine code of a secure function.

The machine code 32 comprises a succession of code lines LI_(j) recorded one after another in the memory 4. Hereinafter, in this chapter, the index j is used to identify the code line LI_(j) from among the other code lines of the machine code 32. Moreover, the index j is also used as a serial number indicating the order in which the lines LI_(j) are ranked. Thus, the code line situated immediately after the line LI_(j) is denoted LI_(j+1). Each code line LI_(j) codes an instruction of the instruction set of the microprocessor 2, able to be executed after having been decrypted and decoded by the unit 10 of this microprocessor.

The structure of all the lines LI_(j) is identical. It is represented in detail in FIG. 2 in the particular case of the line LI_(j). The line LI_(j) comprises a cryptogram CI_(j)*, a code MAC_(j), and a code ECC_(Lj).

The cryptogram CI_(j)* is obtained by encrypting a concatenation CI_(j) with the aid of the secret key ka and of an initialization vector iv_(k). More precisely, the cryptogram CI_(j)* is obtained with the aid of the following relation: CI_(j)*=f_(ka)(CI_(j); iv_(k)), where f_(ka) is an encryption function corresponding to a decryption function f_(ka) ⁻¹ preprogrammed into the module 28. Typically, the function f_(ka) is a symmetric encryption function. Henceforth, the key ka making it possible to decrypt the cryptogram CI_(j)* is prerecorded in the memory 29 so as to allow the module 28 to decrypt this cryptogram CI_(j)*. As explained further on, the initialization vector iv_(k) is for its part contained in a preceding code line of the machine code 32.

The concatenation CI_(j) is here the concatenation of an instruction I_(j) to be executed by the microprocessor 2 and of a code ECC_(Ij). The code ECC_(Ij) makes it possible to detect an error in the instruction I_(j) and to correct this error. For example, the code ECC_(Ij) may be the code known by the acronym BCH (Bose, Ray-Chaudhuri, Hocquenghem) which exhibits the advantage of being particularly easy to implement. However, any other known error-correcting code may be implemented. The size of the code ECC_(Ij) is greater than or equal to 1 or 2 or 3 bits and, generally, less than N_(inst). The size of the code ECC_(Ij) is determined as a function of the desired robustness. The more it is desired to be capable of correcting a significant number of erroneous bits in the instruction I_(j), the larger will be the size of the code ECC_(Ij).

The code MAC_(j) is a code making it possible to verify the integrity and the authenticity of the cryptogram CI_(j)*. This code is commonly called a “message authentication code” and known by the acronym MAC. Such a code MAC_(j) is obtained by constructing a label on the basis of the cryptogram CI_(j)* which normally comprises fewer bits than the cryptogram CI_(j)*. This label is constructed with the aid of a predetermined function such as a hash function. Thereafter, this label is encrypted with the secret key k′ known only to the author of the binary code 30 and the microprocessor 2. Here, the key k′ is prerecorded in the memory 29.

By way of example, to generate the cryptogram CI_(j)* and the code MAC_(j), an authenticated flow-based encryption algorithm is used. This authenticated flow-based encryption algorithm can be chosen from among the various candidates in the CAESAR competition (“Competition for Authenticated Encryption: Security, Applicability, and Robustness”) such as for example one of the algorithms designated by the following names: “ACORN”, “ASCON”, “SILC”, “CLOC”, “JAMBU”, “KETJE”.

The code ECC_(Lj) is an error-correcting code which makes it possible to detect and to correct an error in the cryptogram CI_(j)* and the code MAC_(j). It is for example constructed as described in the case of the code ECC_(Ij).

Hereinafter, the address in the memory 4 at which the line LI_(j) is recorded is denoted @.

The machine code 32 is composed of a succession of base blocks which must be executed one after another. Here, each base block is composed of a succession of code lines which each comprises the cryptogram CI_(j)* of the instruction I_(j) to be executed.

FIG. 3 represents a first arrangement of two base blocks 50 and 52 of the machine code 32. In this first arrangement, the base blocks 50 and 52 are systematically executed one after the other. in the order of execution, the base block 50 precedes the base block 52. in this figure and the following figures:

-   -   the order of execution of the base blocks is represented by an         arrow which points from the preceding base block to the         following base block,     -   a dashed arrow which points at a represented base block         indicates that the base block or blocks which precede this base         block have not been represented so as to simplify the figure,     -   a dashed arrow which points in vacuo from a represented base         block indicates that the base block or blocks following this         represented base block have not been represented so as to         simplify the figure,     -   the symbol “. . . ” inside a base block indicates that not all         the code lines of this base block have been represented.

Each base block starts with a branching address and terminates with a code line which contains the cryptogram of a branching instruction. In FIG. 2, the symbols “@50” and “@52” alongside the first code line of each base block designate the branching addresses, respectively, of the base blocks 50 and 52. The symbol “@XX” designates the branching address of another base block not represented in FIG. 2.

The symbol “Load iv_(XX)” indicated in the last-but-one code line of the base block indicates that this code line comprises the cryptogram of an instruction which, when it is executed by the microprocessor 2, causes the loading of a new initialization vector iv_(XX) into the memory 29. Thus, the symbol “Load iv₅₂” indicates that the initialization vector iv₅₂ is loaded into the memory 29 before the start of execution of the base block 52.

The symbol “Branch @XX” indicated inside the last code line of the base block indicates that this last line comprises the cryptogram of an instruction which, when it is executed by the microprocessor 2, causes an unconditional branching to the branching address @XX.

Here, the same initialization vector iv_(k) is used to decrypt all the cryptograms CI_(j)* of all the code lines of the same base block BB_(k). The index k identifies without ambiguity the base block BB_(k) from among the set of base blocks of the machine code 32. In the figures and in the description, the symbol iv_(k) is hereinafter used to designate in a general manner the initialization vector to be used to decrypt the base block BB_(k). Moreover, in the simple cases such as that represented in FIG. 3 where two base blocks follow one another in the order of execution of the machine code 32, the index k is also used to indicate the order in which these base blocks are executed. For example, the notation BB_(k−1) is, in these simple cases, used to designate the base block systematically executed immediately before the base block BB_(k).

Here, the initialization vector iv_(k) is unique for each base block BB_(k). By “unique for each base block” is meant the fact that the probability that two different base blocks of the machine code 32 are encrypted with the same initialization vector iv_(k) is less than one chance in 100 or in 1000. In particular, the expression “unique for each base block” therefore covers the case where the initialization vectors iv_(k) of all the base blocks are systematically different from one another. For example, in a simple embodiment, during the generation of the code 32, the initialization vectors iv_(k) of each base block are drawn in a random or pseudo-random manner from the set (1; . . . ;2^(Ninst)).

As represented in FIG. 3, in the code 32, the initialization vector iv_(k) is loaded into the memory 29 solely during the execution of a base block preceding the base block BB_(k). In FIG. 3, the initialization vector iv₅₂ necessary for decrypting the block 52 is loaded during the execution of the block 50.

FIG. 4 represents another possible arrangement of several base blocks of 30 the code 32 in the particular case of two preceding base blocks 60 and 62 and of a following base block 64. Here, the blocks 60 and 64 are, for example, identical, respectively, to the blocks 50 and 52 except that the initialization vector for the block 64 is denoted “iv₆₄”. The block 62 is constructed like the block 60 and, in particular, it terminates with two code lines which code the same instructions as those coded in the last two lines of the block 60. However, even though these last two lines code the same instructions, the cryptograms of these instructions are different because the block 62 is encrypted using a different initialization vector iv₆₂ from the vector iv₆₀ used to encrypt the block 60. The other code lines of the block 62 are different from those of the block 60.

FIG. 5 represents a part of the architecture of the machine code 32 when a base block terminates with a call to a machine code 68 of a secure sub-function. The machine code 68 is arranged as previously described for the machine code 32. It is therefore composed of a succession of base blocks. To simplify FIG. 5, only the first base block 80 and the last base block 82 of this machine code 68 have been represented.

The machine code 68 can be called from various base blocks of the machine code 32 and, when the execution of the machine code 68 has terminated, the flow of instructions can return to various base blocks of the machine code 32. Thus, the base block which must be executed after the base block 82 depends on the base block which called the machine code 68. Consequently, in contradistinction to what was described with reference to FIGS. 3 and 4, the base block 80 does not terminate with a code line which codes an instruction for branching systematically to the same address but with a code line which codes a “Return” instruction. Consequently, in FIG. 5, the “Return” symbol is used to identify the last line of the block 82.

In contradistinction to the “Branch” instruction described previously, the “Return” instruction does not explicitly comprise the address of the next base block to be executed. Nor is the “Return” instruction preceded by an instruction for loading an initialization vector to be used to decrypt the next base block to be executed.

Here, when the “Return” instruction is executed by the microprocessor 2, it causes:

-   -   the loading of a new initialization vector contained in a         register R_(p2) of the microprocessor, and then     -   an unconditional jump to an address contained in a register         R_(p1) of the microprocessor 2.

These registers R_(p1) and R_(p2) are loaded with the appropriate values during the execution of the base block from which the machine code 68 is called. For example, in FIG. 5, the machine code 68 is called from a base block 70 and, after the execution of the machine code 68, the execution of the machine code 32 must continue with the execution of a base block 72. The base block 70 terminates with two lines coding respectively, the loading of the initialization vector iv₈₀ into the memory 29 and an unconditional jump to the address @80 of the base block 80 of the machine code 68.

Moreover, before these lines, the block 70 also comprises:

-   -   a line which codes an instruction for loading into the register         R_(p1) the address @72 of the base block 72, and     -   a line which codes an instruction for loading into the register         R_(p2) the initialization vector iv₇₂ necessary to decrypt the         base block 72.

In FIG. 5, these lines are designated by the symbols, respectively “Load R_(p1), @72” and “Load R_(p2), iv₇₂”.

Thus, during the execution of the “Return” instruction, the next base block executed will be the base block 72 and the initialization vector used to decrypt it will be the vector iv₇₂ loaded into the register R_(p2).

Preferably, the registers R_(p3) and R_(p2) are registers of a call stack so as to allow calls to sub-functions from the base blocks of other sub-functions.

FIG. 6 represents a method of execution of the binary code 30 by the microprocessor 2.

The method starts with a step 150 of providing the binary code 30 in the memory 4. Accordingly, for example, the microprocessor 2 copies over the copy 40 inside the memory 4 to obtain the binary code 30 recorded in the memory 4.

Thereafter, during a phase 152, the microprocessor 2 executes the binary code 30 and, in particular, the machine code 32.

The execution of the binary code 30 begins with a step 154 of authenticating the author of this binary code. During this step, the module 28 carries out successively the following operations:

-   -   during an operation 156, the module 28 verifies the authenticity         of the certificate C_(CPU) with the aid of the public key         pk_(OS) contained in the certificate C_(OS).     -   during an operation 158, the module 28 loads the certificate         C_(AUT) from the block 34 and then verifies its authenticity         with the aid of the public key pk_(OS) contained in the         certificate C_(OS).     -   during an operation 160, the module 28 loads the signature         S_(ka*) from the block 34 and verifies its authenticity with the         aid of the key pk_(AUT) contained in the certificate C_(AUT).

If all the verification operations 156, 158 and 160 have been accomplished successfully, then the binary code is correctly authenticated and the method 25 continues via a step 162. Conversely, if one of the operations 156, 158 or 160 has not been accomplished successfully, the module 28 then considers that the authentication of the author of the binary code 30 has failed and the method continues via a step 163. During step 163, the execution of the binary code 30 is stopped.

During step 162, the module 28 loads the cryptograms ka* and iv_(ini)* contained in the block 34 and decrypts them with the aid of the key sk_(CPU) contained in the memory 29. On completion of step 162, the key ka and the initialization vector iv_(ini) used to decrypt the first base block of the machine code 32 are contained in the memory 29.

After step 162, the microprocessor 2 executes. one after another, the base blocks, beginning with the first base block BB_(ini) of the machine code 32.

The execution of each base block consists in executing, in the order in which the code lines LI_(j) of this base block are recorded in the memory 4, the instructions coded by each of these code lines.

For each of the code lines LI_(j) to be executed of the machine code 32, the microprocessor 2 executes the following steps.

During a step 164, the microprocessor 2 loads into a register of the set 12, the code line recorded at the address @_(j) contained in the ordinal counter 26.

Thereafter, the module 28 undertakes a step 166 of securing the instruction coded in the loaded code line.

The manner in which step 166 functions is now described in the case of the line LI_(j). More precisely, during step 166, the module 28 carries out successively the following operations.

During an operation 170, the module 28 verifies whether there exists an error in the cryptogram CI_(j)* or the code MAC_(j) with the aid of the code ECC_(Lj) contained in the line LI_(j) loaded. For example, accordingly, the module 28 constructs, with the aid of a preprogrammed function and of the cryptogram CI_(j)* and of the code MAC_(j), a code ECC_(Lj)′. If the code ECC_(Lj)′ is different from the code ECC_(Lj), then an error is detected. If an error is detected, the module 28 immediately undertakes a step 172.

During step 172, the module 28 triggers the signalling of an execution fault.

Here, in parallel with step 172, if an error is detected, the module 28 undertakes an operation 174. During the operation 174, it corrects the cryptogram CI_(j)* and the code MAC_(j) on the basis of the information contained in the code ECC_(Lj). On completion of step 174, the corrected cryptogram CI_(j)* and the corrected code MAC_(j) are used in place, respectively, of the cryptogram CI_(j)* and of the code MAC_(j) which are contained in the line LI_(j).

The operation 170 makes it possible in particular to detect and to correct faults introduced into the code lines stored in the memory 4 or in the medium 6.

On completion of the operation 174 or if no error was detected during the operation 170, the method continues via an operation 176.

During the operation 176, the module 28 verifies the integrity and authenticity of the cryptogram CI_(j)* with the aid of the code MAC_(j). For example, accordingly, the module 28 constructs a label of the cryptogram CI_(j)* and then encrypts this label with the key k′ contained in its memory 29. If the cryptogram thus constructed is identical to the code MAC, loaded, then the integrity and the authenticity of the cryptogram CI_(j)* is confirmed. In this case, the module 28 undertakes an operation 178. In the converse case, the module 28 undertakes step 172.

The operation 176 makes it possible on the one hand to validate the authenticity of the loaded code line and also to validate that, during the operation 174, the cryptogram CI_(j)* and/or the code MAC_(j) have correctly been corrected. The verification of the authenticity prevents the replacement of the code line by another code line constructed by an author who does not know the key k′.

During the operation 178, the module 28 decrypts the cryptogram CI_(j)* by using the key ka and the initialization vector iv_(k) to obtain the decrypted instruction I_(j) and the decrypted code ECC_(Ij). The key ka was recorded in the memory 29 during step 162. The vector iv_(k) necessary to decrypt the cryptogram CI_(j)* was recorded in the memory 29 during the execution of the base block preceding that which contains this currently processed line LI_(j). If the line LI_(j) is contained in the first base block BB_(ini) of the machine code 32, it is the vector iv_(ini) recorded in the memory 29 during step 162 which is used.

Here, it is the execution of the branching instruction by the unit 10 which indicates to the module 28 that it must replace the initialization vector currently used by the initialization vector loaded during the execution of the preceding base block.

Thereafter, during an operation 180, the module 28 records the decrypted instruction I_(j) and the decrypted code ECC_(Ij) in the queue 22.

Once the unit 10 has executed all the instructions which precede the instruction I_(j) in the queue 22, that is to say when the instruction I_(j) is the next instruction to be executed by the unit 10, the module 28 undertakes an operation 184.

During the operation 184, the module 28 verifies whether there exists an error in the instruction I_(j) contained in the queue 22 with the aid of the code ECC_(Ij) associated with the instruction I_(j) and contained in this same queue 22. This operation is carried out in a similar manner to what was described for the operation 170.

If the module 28 detects an error, then it immediately undertakes step 172. Moreover, in parallel, during an operation 186, the module 28 corrects the instruction I_(j) with the aid of the code ECC_(Ij). The operation 186 is similar to the operation 174.

Thereafter, on completion of the operation 186 or if no error was detected during the operation 184, step 166 terminates and the method continues via a step 190 of executing the instruction I_(j) by the unit 10.

As represented in FIG. 6, in parallel with step 190, the method can comprise:

-   -   a step 198 of securing the unit 10, and/or     -   a step 250 of securing the processed data.

These steps 198 and 250 are described in greater detail in the following chapters.

The operation 184 makes it possible to detect a modification of the instruction I_(j) which would occur between the instant at which it is recorded in the queue 22 and the instant at which it is executed by the unit 10. The operation 184 makes it possible also to trigger an execution fault if the machine code 32 control flow has been modified. Indeed, a modification of the control flow was manifested by the fact that after the execution of the base block BB_(k−1) it is not the base block BB_(k) which is executed but another base block BB_(t). In this case, during the execution of the block BB_(k−1), the initialization vector v_(k−1) is loaded into the memory 29. Henceforth, during the execution of the block BB_(t), the cryptogram CI_(j)* is decrypted with the aid of the vector iv_(k) which corresponds to the block BB_(k) and not with the aid of the vector iv_(t) which corresponds to the block BB_(t). Consequently, the decryption of the cryptogram CI_(j)* with the aid of the vector iv_(k) leads to the obtaining of an incorrect instruction I_(j) and of an incorrect code ECC_(Ij), this being detected during the operation 184.

In a similar manner, the operation 184 makes it, possible also to detect a disturbance of the execution of the “Return” operation of the base block 82.

During the execution of the machine code 32, if attacks lead to an alteration of an instruction to be protected or a modification of the control flow, the microprocessor 2 signals, during step 172, a fault in the execution of the machine code 32. In response to such a signalling, during a step 192, the microprocessor 2 implements one or more counter-measures. Very numerous counter-measures are possible. The counter-measures implemented can have very different degrees of severity. For example, the counter-measures implemented can go from simple display or simple storage of an error message without interrupting the normal execution of the machine code 32 up to definitive shutdown of the microprocessor 2. The microprocessor 2 is considered to be shut down when it is definitively placed in a state where it is incapable of executing any machine code. Between these extreme degrees of severity, there exist numerous other possible counter-measures such as:

-   -   the indication by way of a man-machine interface of the         detection of faults,     -   the immediate interruption of the execution of the machine code         32 and/or its reinitialization, and     -   the deletion of the machine code 32 from the memory 4 and/or the         deletion of the backup copy 40 and/or the deletion of the secret         data.

Moreover, here, the counter-measure implemented during step 192 can be selected as a function of the error detected and therefore as a function of the operation which led to the detection of this fault. For example, the counter-measure selected will not be the same depending on whether the error was detected during the operation 170, 176 or 184.

Chapter IV: Securing of the Arithmetic and Logic Unit 10:

In this chapter, by “arithmetic and logic instruction” is meant an instruction of the instruction set of the microprocessor 2 which, when it is executed by this microprocessor, records in a register R_(res) of the microprocessor a datum obtained:

-   -   either by modifying the bits of a single datum D₁ recorded in a         register of the microprocessor, or,     -   else by combining together the bits of several data D₁ to D_(n)         recorded, respectively, in registers R₁ to R_(n) of the         microprocessor 2, where n is an integer equal to the number of         data to be combined.

Conventionally, n is equal to two in the case where several data must be combined. n equal to one corresponds to the case where the arithmetic and logic instruction modifies the bits of a single datum D₁.

The registers in which the datum or data to be processed are recorded are typically identified by one or more operands of the arithmetic and logic instruction.

Likewise, the register R_(res) in which the result D_(res-p) of the arithmetic and logic instruction must be recorded can also be identified by an operand of this arithmetic and logic instruction.

The opcode of the arithmetic and logic instruction identifies the operation to be executed by the unit 10 so as to modify or combine the datum or data D₁ to D_(n). Hereinafter, the symbol “*” is used to designate this operation in a generic manner. Thus, the notation D₁*D₂* . . . *D_(n) designates in a generic manner the operation executed by the arithmetic and logic instruction when it is executed by the microprocessor 2.

In the case where n is equal to one, the arithmetic and logic operation is for example chosen from the group consisting:

-   -   of the operations of right and left shifting of the bits of the         datum D₁, and     -   of the operations of extracting a predefined range of bits of         the datum D₁.

In the case where n is greater than or equal to two, the operation “*” is chosen from the group consisting of the following operations:

-   -   the arithmetical addition operation,     -   the arithmetical subtraction operation,     -   the arithmetical multiplication operation,     -   the arithmetical division operation,     -   the logical “OR” operation,     -   the logical “exclusive OR” operation,     -   the logical “AND” operation.

By injecting faults while the unit 10 is functioning, it is possible to disturb its functioning so that the result of the execution of the arithmetic and logic instruction does not correspond to that expected. One is then said to have caused a malfunction of the unit 10.

This chapter describes a solution for detecting such a malfunction of the unit 10. Here, this solution is described in the particular case where it is implemented in combination with the solution described in the preceding chapter. It corresponds to step 198 represented in FIG. 6.

The registers R₁ to R_(n) and the register R_(res) are, for example, registers of the set 12 of the microprocessor 2.

Hereinafter, step 198 is described in the particular case where the arithmetic and logic instructions whose execution one wishes to secure are the instructions of the following list:

-   -   1: The instruction for adding the data D₁ and D₂ contained in,         respectively, the registers R₁ and R₂. This operation is         designated by the pseudocode “ADD R₁, R₂”.     -   2: The instruction for subtracting the data D₁ and D₂ contained         in, respectively, the registers R₁ and R₂. The pseudocode used         to designate this operation is “SUB R₁, R₂”.     -   3: The instruction for multiplying the data D₁ and D₂ contained         in, respectively, the registers R₁ and R₂. The pseudocode used         to designate this operation is “MDL R₁, R₂”.     -   4: The instruction for dividing the datum D₁ by the datum D₂         contained in, respectively, the registers R₁ and R₂. The         pseudocode used to designate this operation is “DIV R₁, R₂”.     -   5: The “exclusive OR” instruction between the data D₁ and D₂         contained in, respectively, the registers R₁ and R₂. The         pseudocode used to designate this operation is “XOR R₁, R₂”.     -   6: The “logical AND” instruction between the data D₁ and D₂         contained in, respectively, the registers R₁ and R₂. The         pseudocode used to designate this operation is “AND R₁, R₂”.     -   7: The “logical OR” instruction between the data D₁ and D₂         contained in, respectively, the registers R₁ and R₂. The         pseudocode used to designate this operation is “OR R₁, R₂”.     -   8: The instruction for right shift of a bit of the datum D₁         contained in the register R₁. The pseudocode used to designate         this operation is “SHIFTR R₁”.     -   9: The instruction for left shift of a bit of the datum D₁         contained in the register R₁. The pseudocode used to designate         this operation is “SHIFTL R₁”.

Hereinafter, the number associated by the list hereinabove with each arithmetic and logic instruction is used to identify this instruction. Thus, the instruction I₁ is addition, the instruction I₂ is subtraction and so on and so forth.

Here, the size of each datum D₁, D₂ and D_(res) is for example equal to the size of the instructions I_(j) of the instruction set of the microprocessor 2. Here, this size is therefore equal to 32 bits.

The structures of the registers R₁, R₂ and R_(res) are identical and represented in the particular case of the register R₁ in FIG. 7.

The register R1 comprises:

-   -   a range of 32 bits containing the datum D₁,     -   a range containing a code ECC_(D1) making it possible to detect         and to correct an error in the datum D₁, and     -   nine successive ranges of bits containing, respectively, codes         C_(1,1) to C_(1,9).

The code ECC_(D1) is for example constructed as described in the case of the code ECC_(Ij) except that it is constructed on the basis of the datum D₁ and not on the basis of the instruction I_(j). For example, this code ECC_(D1) is generated during the execution or during the generation of the binary code 30.

During the recording of the datum D₁ in the register R₁, each code C_(1,1) to C_(1,9) is generated by the module 28 with the aid of a preprogrammed relation defined in a generic manner in the following manner: C_(i,)*=F*(D₁) where:

-   -   the index i identifies a register from among the registers R₁ R₂         and R_(res),     -   the>index * identifies the arithmetic and logic instruction from         among the instructions I₁ to I₉, and     -   the function F* is a function preprogrammed into the module 28         and associated with the arithmetic and logic instruction         identified by the index *.

The size of the code C_(i,)* is denoted N_(i,)*. The size N_(i,)* is generally less than the size of the data D₁, D₂ and D_(res) and often at least twice as small.

Here, the values 1, 2 and 3 of the index i designate, respectively, the registers R₁, R₂ and R_(res). The values 1 to 9 of the index * designate, respectively, the instructions I₁ to I₉.

In the case of the instructions for which n is greater than or equal to 2, that is to say here in the case of the instructions I₁ to I₇, the function F* is a homomorphism from a set A furnished with the operation “*” to a set B furnished with the operation “#” such that F*(D₁*D₂)=F*(D₁)#F*(D₂). Here, the set A is the set of numbers that are codable on 32 bits, that is to say the set of possible data D₁ and D₂. The set B is the set of numbers that are codable on N_(i,)* bits. Stated otherwise, by using the notations introduced previously, the function F* is such that F*(D_(res-p))=C_(1,)*#C_(2,)* in case of absence of malfunction of the unit 10.

For each instruction I₁ to I₇, it is possible to find numerous functions F* which are appropriate. Hereinbelow, by way of illustration, for each of the instructions I₁ to I₇, one or more possible functions F* are given.

A function EDC(D_(i)) which returns to an error-detecting code in respect of the datum D_(i). This function EDC is for example a checksum. Such functions EDC(D_(i)) exhibit one or more of the following properties:

-   -   EDC(D₁+D₂)=EDC(D₁)+EDC(D₂),     -   EDC(D₁−D₂)=EDC(D₁)−EDC(D₂),     -   EDC(D₁×D₂)=EDC(D₁)×EDC(D₂),         where the symbols “+”, “−”, and “×” designate respectively, the         operations of addition, subtraction and multiplication.

Thus, such functions EDC are appropriate for realizing the functions F₁, F₂ and F₃. It Will be noted moreover that in this particular case, the operations “#” and “*” on the sets B and A are identical.

The function p(D_(i)) which returns 0 if the datum D_(i) is even and 1 otherwise. This function exhibits the following property: p(D₁+D₂)=p(D₁) XOR p(D₂) and p(D₁×D₂)=p(D₁) OR p(D₂), where the symbols “XOR” and “OR” designate, respectively, the “exclusive OR” and “OR” operations. This function is appropriate therefore for the implementation of the functions F₁ and F₃.

A logarithm function denoted “Log”. A logarithm function exhibits the following properties: Log(D₁×D₂)=Log(D₁)+Log(D₂) and Log (D₁/D₂)=Log(D₁)−Log(D₂), where the symbol “/” designates the division operation. Thus, a logarithm is appropriate for implementations of the functions F₃ and F₄. In this case, the operation “#” is addition or subtraction.

The function CS(D_(i)) which returns he checksum of the datum D_(i). This function exhibits the following properties:

-   -   CS(D₁ XOR D₂)=CS(D₁) XOR CS(D₂),     -   CS(D₁ AND D₂)=CS(D₁) AND CS(D₂),     -   CS(D₁ OR D₂)=CS(D₁) OR CS(D₂),         where the “AND” symbol designates the “AND” logic operation.         Thus, this function is appropriate for an implementation of the         functions F₅, F₆ and F₇.

In the case where n is equal to 1, that is to say here in the case of the instructions I₈ and I₉, the function F* is not a homomorphism. In this case, the function F* is such that there exists a function T* such that F*(D₁)=T*(F*(D₁)). Stated otherwise, the function T* is invariant under F*(D₁). The function T* therefore returns the code C_(1,)* from the code C_(1,)*.

In the case of the instruction I₉, the function F₉ is for example the function which calculates a checksum on all the bits of the datum D₁ except on its highest-order bit, that is to say without taking into account the leftmost bit of the datum D₁. The function T₉ is then the same checksum on all the bits of F₉(D₁) except the lowest-order bit, that is to say that situated furthest to the right in F₉(D₁). With such functions F₉ and T₉, we do indeed have the following relation: F₉(D₁)=T₉(F₉(D₁)). These functions F₉ and T₉ are therefore appropriate for the instruction I₉.

Moreover, by choosing the functions F₈ and T₈ equal, respectively, to the functions T₉ and F₉, a possible implementation for the functions F₈ and T₈ is obtained.

FIG. 8 represents the detail of the operations carried out by microprocessor 2 during the execution of step 198 to secure the execution of the arithmetic and logic instructions I₁ to I₉.

Each time an instruction for loading a datum into one of the registers R_(i) is executed by the unit 10, during step 190, the datum D, and the code EEC_(Di) are written into this register R_(i).

In response, during an operation 202, for each instruction I₁ to I₉, the module 28 calculates each of the codes C_(i,)* corresponding with the aid of the relation C_(i,)* =F*(D_(i)), where:

-   -   D_(i) is the new datum loaded into the register R_(i), and     -   the function F* is the function preprogrammed into the module 28         and associated with the operation “*”.

Each of the codes C_(i,)* thus calculated is recorded in the registers R_(i) as represented in FIG. 7.

Before the execution of the instructions I₁ to I₇, the operation 202 is executed once for the datum D₁ and once for the datum D₂. In the case of the instructions I₈ and I₉, it suffices that the operation 202 be executed just once for the datum D₁ before the execution of one of the instructions I₈ and I₉.

Thereafter, each time an arithmetic and logic instruction is on the point of being executed by the unit 10, just before its execution, during an operation 204, the module 28 verifies whether there exists an error in the datum contained in the register R_(i) identified by an operand of the instruction I_(j) to be executed.

During this operation, for each register R_(i) concerned, the module 28 verifies, with the aid of the code EEC_(Di), whether the datum D_(i) currently recorded in this register does or does not exhibit an error. This operation is, for example, carried out as described in the case of the operation 170.

If the module 28 detects an error, it undertakes step 172 and, in parallel, an operation 206. During the operation 206, it corrects the datum D_(i). The operation 206 is for example carried out in a similar manner to what was described for the operation 174.

If the module 28 does not detect any error or on completion of the operation 206, during step 190, the microprocessor 2 decodes the instruction I_(j) and then the unit 10 executes it and records the result D_(res-p) in the register R_(res).

In response, during an operation 210, the module 28 calculates the code ECC_(D3) and all the codes C_(3,)* on the basis of the datum D_(res-p) recorded in the register R_(res) and records these various codes calculated in the register R_(res). Typically, the calculation of the codes C_(3,)* is carried out here as described for the operation 202.

Thereafter, during an operation 212, the module 28 verifies whether a malfunction of the unit 10 has occurred during the execution of the arithmetic and logic instruction.

If the instruction executed during step 190 is one of the instructions I₁ to I₇, then the module 28 executes the following sub-operations.

During a sub-operation 214, the module 28 selects, from among the instructions I₁ to I₇, that which corresponds to the arithmetic operation executed. In the following sub-operations, the symbol “*” designates the instruction thus selected and F* the preprogrammed function associated therewith.

During a sub-operation 216, the module 28 also selects, from among the various codes C_(3,)* recorded in the register R_(res), the sole code C_(3,)* which corresponds to the selected instruction. Hereinafter, the code C_(3,)* selected during this sub-operation is denoted C_(res-p).

Next, during a sub-operation 218, the module 28 also calculates a code C_(res-t) by combining the codes C_(1,)* and C_(2,)* recorded, respectively, in the registers R₁ and R₂ prior to the execution of the arithmetic and logic instruction. More precisely, the module 28 calculates the code C_(res-t) with the aid of the following relation: C_(res-t)=C_(1,)*#C_(2,)*, where the symbol “#” designates the operation such that F*(D₁*D₂)=F*(D₁)#F*(D₂).

For example, in the case of the instruction I₁ and of the parity function p(..) previously described, the operation “#” is the “exclusive OR” operation. In this case, the code C_(res-t) is the result of the following exclusive or C_(1,1) XOR C_(2,1).

Finally, during a sub-operation 220, the module 28 compares the codes C_(res-p) and C_(res-t) calculated. If these codes are different, the module 28 triggers the execution of step 172. In the converse case, no signalling of an execution fault is triggered and the method continues via the execution of the following instruction of the queue 22.

The execution of these sub-operations 214 to 220 makes it possible to detect a malfunction of the unit 10 since the calculated codes C_(res-p) and C_(res-t) are identical only if the unit 10 has correctly executed the operation “*”. This is explained by the following relation: C_(res-p)=F*(D_(res-p))=F*(D₁*D₂)=F*(D₁)#F*(D₂)=#C_(2,)*=C_(res-t).

If the instruction executed during step 190 is one of the instructions I₈ and I₉, then during a sub-operation 222, the module 28 selects the function T* associated with this arithmetic and logic instruction, that is to say the function T₈ if dealing with the instruction I₈, otherwise the function T₉.

During a sub-operation 224, the module 28 selects the code C_(1,)* associated with the operation “*” executed during step 190. This selected code is denoted C_(res-t).

During a sub-operation 226, the module 28 calculates a code C_(res-p) with the aid of the relation C_(res-p)=T*(D_(res-p)) where T* is the function selected during sub-operation 222.

After sub-operation 224, the method continues via sub-operation 220.

In the case of the instructions I₈ and I₉, the codes C_(res-p) and C_(res-t) are identical solely if the unit 10 has operated correctly. This is demonstrated with the aid of the following relation: C_(res-p)=T*(D_(res-p))=T*(F*(D₁))=F*(D₁)=C_(1,)*=C_(res-t).

Chapter V: Securing of the Data

The binary code 30, in addition to the machine code 32, can comprise data to be processed during the execution of the machine code 32. Moreover, during the execution of the machine code 32, the latter may generate data. These data are typically contained in data blocks which each correspond to a predetermined range of addresses of the memory 4 dedicated to the storage of these data. Such data blocks are also known by the term “data segment” or of “data page”.

To read a datum from a data block, the machine code 32 comprises a loading instruction which, when it is executed by the microprocessor 2, causes the loading of a code line LD_(j) situated at the address @_(j) inside this data block. In this case, in contradistinction to the code lines LI_(j) described in chapter III, the line LD_(j) codes a datum D_(j) to be processed by the microprocessor and not an instruction I_(j) executable by the unit 10.

To write a datum to a data block, the machine code 32 comprises a writing instruction which, when it is executed by the microprocessor 2, causes the writing of a line LD_(j) in one of the data blocks.

In a similar manner to what was described in the case of the instructions I_(j), a datum D_(j) may be corrupted in the memory 4 or in registers of the microprocessor 2 by the implementation of attacks such as an attack by fault injection. Moreover, an attacker can also try to modify the operation of the binary code 30 by moving the data coded in the memory 4 or by replacing them with older data. Thus, it is also useful to secure the data recorded in the memory 4 or in internal registers of the microprocessor.

For this purpose, each code line LD_(i) coding a datum exhibits the structure represented in FIG. 9. The structure of the lines LD_(i) is practically identical to that of the lines LI_(j) coding instructions. More precisely, the structure of the line LD_(j) is identical to the structure of the line LI_(i) except that the cryptogram CI_(j)* is replaced with a cryptogram CD_(j)*. Given that the codes MAC_(j) and ECC_(Lj), of the line LD_(j) are calculated as already described in the case of the lines LI_(j), they are here designated by the same symbols and will not be described again.

The cryptogram CD_(j)* is obtained by encrypting, with the function f_(kB), a concatenation CD_(j). Here, the function f_(ka) is the same as that already described in the case of the lines LI_(j). Thus, the cryptogram CD_(j)* is obtained with the aid of the following relation: CD_(j)*=f_(kB)(CD_(j)*, iv_(j)). The function f_(ka) is preprogrammed into the module 28.

The concatenation CD_(j) is the concatenation of the datum D_(j) and of a code ECC_(Dj). The code ECC_(Dj) makes it possible to detect and to correct an error in the datum D_(j). It is typically constructed as described for the code ECC_(Ij).

The cryptogram CD_(j)* differs from the cryptogram CI_(j)* in that the initialization vector iv_(j) used during the encryption of the concatenation CD_(j) is dependent on the address @_(j) where the line LD_(j) is recorded. For this purpose, the module 28 comprises a preprogrammed function F_(iv) which, with each address @_(j) of the memory 4 associates a different initialization vector iv_(j). Preferably, the function F_(iv) is such that with any two consecutive addresses @_(j) and @_(j+1), it associates two different vectors, respectively iv_(j) and iv_(j+1), and the disparity between the numerical values of these two vectors iv_(j) and iv_(j+1) varies as a function of the index j. For example, the function F_(iv) is a hash or encryption function. The following relation therefore holds: iv_(j)=F_(iv)(@_(j)).

The securing of the data D_(j) will now be described in greater detail with reference to the method of FIG. 10 and in the particular case where it is implemented in combination with the teachings of the preceding chapters. More precisely, the securing of the data D_(j) occurs each time the instruction executed during step 190 is an instruction for loading or writing or processing a datum D_(j). The method of FIG. 10 represents the operations executed during step 250 to secure the data D_(j).

Each time that during step 190 the unit 10 executes an instruction which leads to recording a new datum D_(j) in a register, denoted here R_(j), of the microprocessor 2, during an operation 252, the module 28 calculates the code ECC_(Dj) on the basis of the datum D_(j). This code ECC_(Dj) calculated is thereafter concatenated with the datum D_(j) in the register R_(j).

Subsequently, during a new execution of step 190, the unit 10 executes an instruction for recording the datum D_(j) contained in the register R_(j) at the address @_(j) of the memory 4.

In response, during an operation 254, the module 28 constructs the code line LD_(j) which must be recorded at the address @_(j) on the basis of the datum D_(j). Accordingly, during this operation, the module 28:

-   -   calculates an initialization vector iv_(j) with the aid of the         relation iv_(j)=F_(iv)(@_(j)), and then     -   encrypts the concatenation CD_(j) of the datum D_(j) and of the         code ECC_(Dj) with the aid of the function f_(ka) and of the         initialization vector iv_(j) calculated according to the         following relation: CD_(j)*=f_(ka)(CD_(j); iv_(j)), and then     -   calculates the code MAC_(j) on the basis of the cryptogram         CD_(j)*, and then     -   calculates the code ECC_(Lj) on the basis of the cryptogram         CD_(j)* and of the code MAC_(j) calculated.

Thereafter, the line LD_(j) constructed is transferred and recorded in the memory 4 at the address @_(j).

The address @_(j) is situated inside a predetermined data block BD_(m). Each data block BD_(m) is associated with a code EDC_(m) which makes it possible to detect an error if one of the code lines contained in this block BD_(m) has been modified from the last update of the code EDC_(m). The code EDC_(m) is therefore an error-detecting code.

The code EDC_(m) may be contained in the memory 4, for example at the end of the data block BD_(m) associated with this code or in a register of the microprocessor associated with the block BD_(m).

During an operation 256, immediately after or in parallel with the execution of the instruction for writing the new line LD_(j) to the block BD_(m), the code EDC_(m) associated with this block BD_(m) is updated and then recorded. Here, to accelerate the execution of this operation 256, the code EDC_(m) is defined by the following relation: EDC_(m) =MAC₁ XOR MAC₂ XOR . . . XOR MAC_(mm), where:

-   -   the symbol XOR designates the “exclusive OR” operation,     -   the codes MAC₁ to MAC_(mm) are the codes MAC_(j) of all the         lines LD_(j) of the block BD_(m), and     -   mm is the number of lines LD_(j) contained in the block BD_(m).

When the code EDC is thus defined, the operation 256 can be carried out with the aid of the following relation: EDC_(m)=EDC_(m) XOR MAC_(jold) XOR MAC_(jnew), where:

-   -   the symbols EDC_(m) on the right and on the left of the “=” sign         designate, respectively, the old value of the code EDC_(m)         before the recording of the new line LD_(j) and the new value of         the code EDC_(m) after the recording of this new line LD_(j),     -   MAC_(jold) designates the code MAC_(j) of the old line LD_(j)         which is replaced with the new line LD_(j), and     -   MAC_(jnew) designates the code MAC_(j) of the new line LD_(j)         which is recorded at the address @_(j).

Thus, the number of operations to be executed to update the code EDC_(m) is limited.

The operation 256 can be carried out by the module 28 or by a calculation unit incorporated into the memory 4. Such memories 4 incorporating a calculation unit are known by the term “smart RAM” or “In-memory computing”.

If the next instruction to be executed during step 190 is an instruction for loading a line LD_(j), then, during an operation 260, the module 28 verifies, with the aid of the code EDC_(m), whether an error exists in the block BD_(m) which contains this line LD_(j).

If the module 28 detects that an error exists, then the method continues via the execution of step 172 and the line LD_(j) is not loaded into the microprocessor 2.

If the module 28 does not detect any error, then the unit 10 executes an instruction for loading the line LD_(j) and the latter is loaded into a register of the microprocessor 2. Typically, this loading instruction comprises an operand which indicates the address @_(j) at which the line LD_(j) to be loaded is situated. Here, when the unit 10 executes this loading instruction, it loads the line LD_(j) into a register R_(j) of the set 12 for example.

Thereafter, the module 28 executes operations 270, 274, 276 and 278 which are identical, respectively, to the operations 170, 174, 176 and 178 of the method of FIG. 6 except that it is the corresponding codes contained in the line LD_(j) which are used and not those contained in a line LI_(j).

Moreover, during the operation 278, the module 28 calculates the initialization vector iv_(j) necessary to decrypt the cryptogram CD_(j)* on the basis of the address @_(j) and with the aid of the relation iv_(j)=F_(iv)(@_(j)).

Once the cryptogram CD_(j)* has been decrypted, during an operation 280, the module 28 records the datum D_(j) decrypted and the code ECC_(Dj) decrypted in the register R_(j) while waiting for this datum to be processed by the unit 10.

When the next instruction which will be executed by the unit 10 is an instruction which processes the datum D_(j), the module 28 undertakes operations 284 and 286. The module 28 identifies that the next instruction to be executed will process the datum D_(j) since this instruction generally comprises an operand which identifies the register R_(j) in which the datum D_(j) is recorded. The operations 284 and 286 are, for example, identical, respectively, to the operations 184 and 186 of the method of FIG. 6, except that here, it is the datum D_(j) and the code ECC_(Dj) which are used and not the instruction I_(j) and the code ECC_(Ij).

Thereafter, on completion of the operation 286 or if no error was detected during the operation 284, the unit 10 executes the instruction which processes the datum D_(j).

The data securing method described here furthermore presents the same advantages as those presented in chapter III in particular because of the fact that the structure of the line LD_(j) is practically identical to that of the line LI_(j).

Moreover, the fact of encrypting the datum D_(j) with the aid of an initialization vector iv_(j) which depends on the address @_(j) makes it possible to detect whether a line LD_(j) has been moved inside a data block BD_(m). Indeed, if two lines LD₁ and LD₂ of one and the same block BD_(m) are swapped, this does not necessarily modify the code EDC_(m) and such a swapping of the lines LD₁ and LD₂ is not necessarily detected during the operation 260. On the other hand, since the datum D₁ is encrypted with an initialization vector iv₁ which depends on the address @₁, if the line LD₁ is moved and is situated at an address @₂ in the memory 4, during the loading of this line on the basis of this address @₂, the cryptogram CD₁* will be decrypted with the aid of the initialization vector iv₂ and not with the aid of the vector iv₁. Such incorrect decryption of the datum D₁ and of the code ECC_(D1) is then detected during the operation 284.

Step 250 described here makes it possible also to detect an attack consisting in replacing a line LD₁ by a different line LD_(1old) previously recorded at the same address @₁. Such a replacement will not be able to be detected during the execution of the operation 284. On the other hand, it will be detected during the execution of the operation 260 since the lines LD₁ and LD_(1old) are different.

FIG. 11 represents a compiler 300 able to automatically generate the binary code 30 on the basis of a source code 302. For this purpose, the compiler 300 typically comprises a programmable microprocessor 304 and a memory 306. The memory 306 contains the instructions and the data necessary for, when they are executed by the microprocessor 304, automatically generating the binary code 30 on the basis of the source code 302. In particular, during the compilation of the source code 302, the microprocessor 304 automatically generates the appropriate initialization vectors iv_(k) and the code lines LI_(j) and LD_(j). The design and production of such a compiler are within the scope of the person skilled in the art on the basis of the explanations given in this description.

Chapter VI: Variants: Variants of the Apparatus 1:

The memory 4 can also be a nonvolatile memory. In this case, it is not necessary to copy the binary code 30 into this memory before launching the execution thereof since it is already situated therein.

As a variant, the memory 4 can also be an internal memory integrated into the microprocessor 2. In the latter case, it is produced on the same substrate as the other elements of the microprocessor 2. Finally, in other configurations, the memory 4 is composed of several memories some of which are internal memories and others external memories.

The main memory 4 can comprise a first volatile memory of large capacity and a second volatile memory of smaller capacity but, in which the reading and writing operations are faster. The second memory is known by the term “cache memory”. The cache memory can be a memory external to the microprocessor 2 or an internal memory of the microprocessor 2. In certain embodiments, several different levels of cache memories can be used.

Numerous different hardware architectures are possible for producing the module 28. In particular, the module 28 can be made by combining several hardware blocks of the microprocessor 2 fulfilling respective functions and each situated in a different area of the chip of the microprocessor 2.

Variants of the Securing of the Machine Code:

As a variant, certain functions or parts of the binary code 30 are not secure. To manage the execution of such a binary code which comprises at one and the same time a secure function and non-secure functions, the instruction set of the microprocessor 2 can be supplemented with:

-   -   an instruction for activating a secure mode of operation of the         microprocessor 2, and     -   an instruction for deactivating this secure mode.

In this case, the instruction for activating the secure mode is situated in the binary code 30 just before the call to the secure function and the instruction for deactivating the secure mode is situated just after the end of the secure function. When the instruction for activating the secure mode is loaded by the microprocessor 2, in response, the module 28 begins to process the following instructions and the data of the binary code as described in the preceding chapters. When the instruction for deactivating the secure mode is loaded by the microprocessor 2, in response, the module 28 is deactivated. In the latter case, the processing of the following instructions and data of the binary code are not processed by the module 28 but loaded directly into the queue 22 or into the registers of the set 12.

As a variant, an “update” instruction is added to the instruction set of the microprocessor. When this “update” instruction is executed by the microprocessor 2, it indicates to the module 28 that from now, the new vector iv_(k) previously loaded in the memory 29 must be used to decrypt the code lines LI_(j). Hence, in this case, the use of a new initialization vector iv_(k) can be triggered other than by the execution of a branching instruction. In this case, the method described can also be implemented with implicit branching instructions. Indeed, the last instruction which terminates with an implicit branching instruction is then the “update” instruction. Instead of implementing an “update” instruction as a separate instruction in the instruction set of the microprocessor, it is possible to add an extra bit to each instruction of the instruction set of the microprocessor 2 and to trigger the change of initialization vector ivk only when this extra bit takes a specific value.

Variants of the Structure of a Line L_(Ij) or LD_(j)

As a variant, the structure of a code line described with reference to FIG. 2 or 9 is implemented only for the instructions I_(j) or only for the data D_(j) of the secure function.

The code ECC_(Ij) or the code ECC_(Dj) can be replaced with a simple error-detecting code making it possible only to detect an error in the instruction I_(j) or the datum D_(j) with which said code is concatenated. An error-detecting code does not make it possible to correct the detected error. In this case, the error correction operation 186 or 286 is omitted. Hence, as soon as the module 28 detects an error in a decrypted instruction I_(j) or in a decrypted datum D_(j), for example, the execution of the secure function is systematically interrupted.

In a simplified variant, the code ECC_(Ij) or ECC_(Dj) is omitted. In this case, the cryptogram CI_(j)* or CD_(j)* is only the cryptogram of the instruction I_(j) or of the datum D_(j). In this embodiment, the microprocessor 2 is no longer capable of detecting a modification of the instruction I_(j) or of the datum D_(j) that were to occur between the instant at which the latter is recorded in the queue 22 or a register of the set 12 and the instant at which it is executed or processed by the unit 10.

The code ECC_(Lj) can be replaced with a simple error-detecting code making it possible only to detect an error in the cryptogram CI_(j)* or CD_(j)* and/or the code MAC_(j) which are contained in the same code line. In this case, the correction operation 174 or 274 is omitted. Hence, as soon as the module 28 detects an error in the cryptogram CI_(j)* or CD_(j)* or in the code MAC_(j), for example, the execution of the secure function is interrupted.

In another variant, the code ECC_(Lj) is constructed so as to allow only the detection of an error, either only in the cryptogram CI_(j)* or CD_(j)* or only in the code MAC_(j).

The code ECC_(Lj) can be omitted. In this case, an error in the cryptogram CI_(j)* or CD_(j)* or in the code MAC_(j) can only be detected during the execution of the operation 176 or 276 of verifying the integrity and authenticity of the cryptogram. The detection of an error with the aid of an MAC code is generally more complex than with the aid of a simple error-detecting code or of a simple error-correcting code. Moreover, when the code ECC_(Lj) is omitted, in the case where an error exists in the cryptogram CI_(j)* or CD_(j)* or the MAC_(j), it is not possible to correct this error. In the latter case, for example, the execution of the secure function is therefore systematically interrupted in case of error.

The function used to generate the cryptogram CD_(j)* may be different from that used to generate the cryptogram CI_(j)*. For example, these two functions differ through the fact that they use different encryption keys.

Variants of the Securing of the Arithmetic and Logic Unit:

The number of codes C_(i,)* calculated and associated with the loaded datum D_(i) is not necessarily equal to the total number of different arithmetic and logic instructions which exist in the instruction set of the microprocessor 2. For example, the number of codes C_(i,)* can be reduced when the same codes C_(i,)* are used for various arithmetic and logic instructions. For example, the code C_(i,4) can be omitted if the functions F₃ and F₄ are both logarithmic functions. Indeed, in this case, when the arithmetic and logic instruction to be executed is a multiplication, during the operation 284, the module 28 calculates the code C_(res-t) with the aid of the following relation: C_(res-t)=C_(1,3)+C_(2,3). To verify that the unit 10 has correctly carried out an arithmetical and logical division instruction, the module 28 can calculate the code C_(res-t) with the aid of the following operation: C_(res-t)=C_(1,3)−C_(2,3), where the codes C_(1,3) and C_(2,3) are the same as those used to verify the multiplication operation. In this case, it is not necessary to calculate the codes C_(1,4) and C_(2,4) since they are identical, respectively, to the codes C_(1,3) and C_(2,3). On the other hand, the code C_(3,4) must be calculated on the basis of the datum D_(res-p). In a similar manner, it is possible to detect the malfunction of the unit 10 during the execution of a subtraction instruction by calculating the code C_(res-t) with the aid of the following relation: C_(res-t)=C_(1,1)−C_(2,2) in the case where the function F₁ is also a homomorphism for the set B furnished with the subtraction operation.

In another embodiment, it is possible to detect a malfunction of the unit 10 only when it executes a single or a restricted group of arithmetic and logic instructions of the instruction set of the microprocessor 2. In this case, there exist arithmetic and logic instructions for which the microprocessor does not verify whether they have been executed correctly by the unit 10. This makes it possible to reduce the number of codes C_(i,)* used.

As a variant, the code C_(i,)* is not recorded in the same register R_(i) as that where the datum D_(i) is recorded but in another register specifically associated with this register R_(i).

Variants of the Securing of the Data:

The structure of the lines LD_(j) used to secure the data can be simplified. For example, the codes MAO_(j) and/or ECC_(Lj) can be omitted.

The code ECC_(Dj) can be replaced with a simple code for detecting error in the datum D_(j).

As a variant, the function F_(iv) is identical to the function f_(ka) except that it is applied to the address @_(j). The function F_(iv) can also use the same encryption algorithm as the function f_(ka) but with a different encryption key from the key ka.

In a simplified variant, the function F_(iv) is the identity function. In this case, the initialization vector iv_(j) is systematically equal to the address @_(j).

In other embodiments, to detect a movement of a line LD_(j), the code MAC_(j) is calculated as a function of the vector iv_(j). For example, the code MAC_(j) is calculated on the basis of the concatenation of the cryptogram CD_(j)* and of the vector iv_(j). The code MAC_(j) can also be calculated on the basis of a combination of the cryptogram CD_(j)* and of the vector iv_(j) such as the following combination: CD_(j)* XOR iv_(j). In the case where the code MAC_(j) depends on the vector iv_(j), then it can be used in place of the code ECC_(Dj) to detect an error in case of movement of the line LD_(j) in the memory 4. Indeed, in this case, during verification of the integrity and authenticity of the cryptogram CD_(j)*, the module 28:

-   -   calculates the, vector iv_(j) with the aid of the relation         iv_(j)=F_(iv)(@_(j)), and then     -   combines the cryptogram CD_(j)* read at the address @_(j) with         the vector iv_(j) calculated, and then     -   verifies the integrity and authenticity of this combination on         the basis of the code MAC_(j) contained in the same line LD_(j).         If this line LD_(j) has been moved, the calculated         initialization vector is different from that expected. Hence,         the integrity of the combination of the cryptogram CD_(j)* and         of the initialization vector cannot be verified, thus triggering         the signalling of an execution fault. It will be noted that in         this embodiment, it is possible to detect a movement of the line         LD_(j) without even having to decrypt the cryptogram CD_(j)*. In         this variant, to detect a movement of the line LD_(j), the codes         ECC_(Dj)and ECC_(Lj) can be omitted.

In a similar manner to what was described hereinabove for the code MAC_(j), the code ECC_(Lj) can also be constructed in such a way as to depend on the vector iv_(j). In this case, the movement of the line LD_(j) is detected during the verifications of the code ECC_(Lj). Hence, to detect a movement of the line LD_(j), the codes ECC_(Dj) and MAC_(j) can be omitted.

Step 250 has been described in the particular case of the securing of a datum D_(j). However, as a variant, the same step can be carried out on code lines comprising an instruction I_(j) in place of the datum D_(j). In this case, the cryptogram CI_(j)* is obtained by using an initialization vector iv_(j) and not the vector iv_(k) as described in chapter III. Since the vector iv_(j) is dependent on the address @_(j) where this code line LI_(j) is recorded, it is then possible to detect the movement of a code line coding an instruction to be executed. In this case, typically, the code ECC_(Ij) is used to detect this movement and no longer to detect a modification of the control flow.

In the embodiments described up until now, both the datum D_(j) and the code ECC_(Dj) are coded as a function of the vector iv_(j) since the cryptogram CD_(j)* is encrypted with the aid of this vector iv_(j). As a variant, either only the datum D_(j) or only the code ECC_(Dj) is coded as a function of the vector iv_(j). For example, in the code line, the cryptogram of the datum D_(j) is obtained on the basis of an encryption function which does not use the vector iv_(j), while the cryptogram ECC_(Dj)* of the code ECC_(Dj) is obtained with the aid of the encryption function f_(ka)(ECC_(Dj); iv_(j)). In this case, during the operation 278, the module 28 decrypts the cryptogram of the datum D_(j) without using the vector iv_(j) and decrypts the cryptogram ECC_(Dj)* by using this vector iv_(j). Thereafter, the remainder of the method is identical to what has already been described. In a simplified embodiment, since the datum D_(j) does not need to be coded as a function of the vector iv_(j), it is also possible not to encrypt it. For example, the code line then contains the plaintext datum D_(j) and the cryptogram ECC_(Dj)*. Hence, during the operation 278, the decryption of the datum D_(j) is omitted since it suffices to extract it from the bit range in which it is contained in the line LD_(j).

Conversely, it is also possible to modify the structure of the lines LD_(j) in such a way that only the datum D_(j) is coded as a function of the vector iv_(j). For example, the line LD_(j) comprises a cryptogram D_(j)* of the datum D_(j) obtained by encrypting it with the aid of the function f_(ka)(D_(j); iv_(j)) and a cryptogram ECC_(Dj)* obtained by encrypting the code ECC_(Dj) with the aid of an encryption function independent of the vector iv_(j). During the operation 270, the module 28 decrypts the cryptogram D_(j)* with the aid of the vector iv_(j) calculated and decrypts the cryptogram ECC_(Dj)* without using this vector iv_(j).

Up until now, it is an encryption function which has been described as exemplary embodiment making it possible to code the datum D_(j) or the code ECC_(Dj) as a function of the vector iv_(j). This encryption function can however be as simple as a simple “OR” logic operation between the datum D_(j) and the vector iv_(j) or between the code ECC_(Dj) and the vector iv_(j).

In another simplified embodiment, the code ECC_(Dj) and the code MAC_(j) are omitted. In this case, at least one of the cryptogram D_(j)* and of the code ECC_(Lj) is constructed as a function of the vector iv_(j).

For the detection of the movement of the line LD_(j), it is not necessary to use an error-correcting code. A simple error-detecting code is sufficient. Thus, as a variant. the error-correcting code or codes are replaced with error-detecting codes.

In another embodiment, the code EDC_(m) is omitted. In this case, the operations of processing of this code EDC_(m) are also omitted, such as the operations 256 and 260.

It is possible to construct the code EDC_(m) differently. For example, as a variant, the code EDC_(m) is an error-correcting code which makes it possible in addition to correct an error in the data block BD_(m). In this case. when an error is detected in the block BD_(m), the code EDC_(m) is used to correct the detected error, and then the method continues via the operation 270.

Other procedures for calculating the code EDC_(m) are possible. For example, as a variant, the code EDC_(m) is a checksum or a message authentication code.

Advantageously the code EDC_(m) is recorded in the memory 29.

Other Variants:

In another variant, the keys ka and k′ are the same.

The key ka can be prerecorded in the memory 29. In this case, the cryptogram ka* can be omitted from the block 34.

A code line can be longer than a machine word. In this case, each code line is composed of several machine words generally situated at immediately consecutive memory addresses in the memory 4. In this case, a code line is loaded into the microprocessor 2 not in a single reading operation, but by executing several reading operations. Each reading operation loads a respective machine word of the code line into the microprocessor.

As a variant, the operation 176 or 276 continues systematically via the operation 178 or 278 even if it has not been possible to confirm the integrity or authenticity of the cryptogram. In this case, the operation 176 or 276 serves to trigger the signalling of an execution fault without interrupting the execution of the binary code.

Everything that was described in chapter III can be implemented independently of what was described in the other chapters. For example, steps 198 and 250 can be omitted.

In another variant, the method described in chapter III for detecting an error in the control flow is implemented independently of what was described in chapters IV and V but also independently of some of the characteristics of the method described in chapter III. In particular, to be capable of detecting an error in the control flow, the codes ECC_(Lj) and MAC_(j) can be omitted, as well as all the operations of processing of these two codes.

Everything that was described in chapter IV can be implemented independently of what was described in the other chapters. For example, what was described in chapter IV can be implemented:

-   -   without the binary code being encrypted,     -   without the code MAC_(j) being included in each code line,     -   without the codes ECC_(Lj) and ECC_(Ij) or ECC_(Dj) being         implemented,     -   without the data D_(j) being encrypted with the aid of the         vector iv_(j).

Everything that was described in chapter V can also be implemented independently of what was described in the other chapters. For example, what was described in chapter V can be implemented:

-   -   without the data D_(j) being encrypted,     -   while preserving only a single error-detecting code chosen from         the group consisting of the codes ECC_(Lj), MAC_(j) and         ECC_(Dj), and     -   without a code C_(i,)* being calculated on each loading of a         datum into a register.

All the embodiments described in this text and, in particular, the different variants, can be combined together.

Chapter VII: Advantages of the Embodiments Described: Advantage of Securing the Binary Code:

The encryption of the instructions I_(j) or of the data D_(j) makes it possible to guarantee the confidentiality of the binary code 30, thereby rendering the “Reverse Engineering” of the binary code very difficult. The verification of the integrity of the cryptogram CI_(j)* or CD_(j)* makes it possible to detect the modifications of the binary code that are caused, for example, by attacks such as the injection of faults into the memory 4 or the medium 6. Verifying the authenticity of the instructions and of the data makes it possible to detect and to render very difficult the addition of extra instructions into the binary code 30 by an attacker, for example, so as to introduce malicious software such as viruses thereinto. Indeed, even if the attacker knows the algorithm used to encrypt the instructions I_(j) or the data D_(j), he does not know the secret key, k′ used to construct the code MAC_(j).

The verification, with the aid of the code ECC_(Ij) or ECC_(Dj), of the existence of an error in the instruction I_(j) or the datum D_(j) just before it is used makes it possible to detect a modification of this instruction or of this datum D_(j) whilst it is stored in the queue 22 or a register of the set 12. Indeed, such modifications may be caused by injecting faults into the queue 22 or the registers of the set 12. Thus, the use of the code ECC_(Ij) or ECC_(Dj) makes it possible to detect this type of attack.

The fact that the code ECC_(Ij) or ECC_(Dj) is an error-correcting code and not only an error-detecting code, makes it possible to render the method of execution more robust in relation to attacks by injecting faults into the queue 22 or into the registers of the set 12. Indeed, in this case, the error-correcting code often makes it possible to correct the error introduced into the instruction I_(j) or into the datum D_(j) so that despite the presence of such errors, the secure function continues to execute correctly.

By using the code ECC_(Lj), an error in the cryptogram CI_(j)* or CD_(j)* or in the code MAC_(j) can be detected more rapidly than if only the code MAC_(j) were used for this. The use of the code ECC_(Lj) therefore makes it possible to accelerate the execution of the binary code.

The use of an error-correcting code for the code ECC_(Lj) makes it possible to render the method claimed more robust in relation to attacks by fault injection into the memory 4 or into the medium 6. Indeed, in this case, the error-correcting code often makes it possible to correct the cryptogram CI_(j)* or CD_(j)* or the code MAC_(j) so that despite the presence of such errors, the secure function executes correctly.

Using different secret keys to decrypt the cryptogram CI_(j)* or CD_(j)* and to verify the integrity and authenticity of the code MAC_(j) makes it possible to increase the security of the method.

During the execution of a preceding base block, by loading the initialization vector iv_(k) necessary for the decryption of the following base block BB_(k) into the microprocessor, it is made possible to trigger the signalling of an execution fault if an attacker tries to modify the order in which the base blocks of the machine code 32 must normally be executed. More precisely, such a modification of the control flow will be detected by virtue of the code ECC_(Ij) during the operation 184.

The recording in a register of the microprocessor of the initialization vector iv_(k) to be used to decrypt the base block executed after the execution of a secure sub-function makes it possible to call this secure sub-function from various base blocks of the machine code 32 of the secure function. Indeed, in this case, it is not possible to code the vector iv_(k) to be used in the last base block of the secure sub-function since the following base block is not always the same and is therefore not always encrypted with the aid of the same vector iv_(k).

The verification of the authenticity of the application key ka on the basis of various cryptographic certificates at least one of which is recorded in the secure memory of the microprocessor makes it possible to guarantee that the binary code 30 was generated by an author authorized to do so and not by a third-party who does not have the right to generate such binary code for the microprocessor 2.

Advantages of Securing the Arithmetic and Logic Unit:

When faults are injected into the unit 10, the result D_(res-p) obtained on completion of the execution of the arithmetic and logic operation may be different from the expected theoretical result D_(res-t). The claimed method makes it possible to detect such a malfunction of the unit 10 without, for example, the failed arithmetic and logic operation having to be executed several times.

Advantages of Securing the Data:

In the claimed method, if an attacker moves a line LD_(j), an error is then detected with the aid of an error-detecting code. By virtue of this, it is therefore much more difficult to implement an attack in which the code lines are moved without this attack being detected.

Moreover, the claimed method is fast. Indeed, the datum D_(j) and the error-detecting code associated with this datum D_(D) are recorded at the same address @_(j). Consequently, a single reading operation suffices to read at one and the same time the datum and its error-detecting code. Conversely, if these items of information were recorded at different addresses, several reading operations would be required in order to detect an error and this would slow down the execution of the method.

The use of the error-detecting code EDC_(m) makes it possible to detect an attack which consists in replacing a code line situated at an address @_(j) with another code line which was previously recorded at the same address @_(j). Indeed, such a replacement cannot always be detected in the absence of this code EDC_(m).

The fact of constructing the code EDC_(m) solely on the basis of the codes MAC_(j) of the lines LD_(j) accelerates the calculation of this code EDC_(m) since the codes MAC_(j) are generally much shorter than the complete code line. Moreover, this acceleration of the calculation is obtained without modifying the reliability of the error detection since the code MAC_(j) depends on the datum D_(j).

The use of an “exclusive OR” to update the code EDC_(m) allows iterative updating of this code, this being much faster than calculating, whenever a new code line is written, the new code EDC_(m) on the basis of the content of each of the lines contained in the block BD_(m).

Using an error-correcting code in the guise of code ECC_(Dj) makes it possible, in addition, to correct a detected error. This therefore makes it possible to continue the execution of the secure function even if an error has been signalled.

Recording the code EDC_(m) in the memory 29 increases the security of the method since it is very difficult for an attacker to modify this memory.

The fact of coding both the datum D_(j) and the code'ECC_(Dj) by encrypting it with the aid of an encryption function parametrized by the vector iv_(j) makes it possible to increase the security of the method. Indeed, in addition, the confidentiality of the datum D_(j) and of the code ECC_(Dj) is ensured.

The fact that a code capable of detecting an error in the cryptogram CD_(j)* is used as error-detecting code makes it possible to detect a movement of a code line without even having to decrypt this cryptogram CD_(j)*. 

1. A method of execution of a binary code of a secure function by a microprocessor, the method comprising: a) the recording in a main memory at an address @_(j) of a code line, this code line containing: a datum D_(j) to be processed by the microprocessor or a cryptogram of datum D_(j), and a first error-detecting code making it possible to detect an error in the datum D_(j) or in its cryptogram if this datum D_(j) or its cryptogram is modified after its recording in the main memory, at least one of the datum D_(j), of its cryptogram and of the first error-detecting code being encrypted as a function of an initialization vector iv_(j), this initialization vector iv_(j) varying as a function of the address @_(j) at which the code line is recorded according to a relation iv_(j)=F_(iv)(@_(j)), where the function F_(iv) is a preprogrammed function of a securing hardware module of the microprocessor which associates a different initialization vector iv_(j) with each different address @_(j) of the main memory, b) during the execution of the binary code by the microprocessor, the method comprises the following operations: 1) the execution of a loading instruction by the microprocessor which causes the loading into the registers of the microprocessor of the code line recorded at the address @_(j), and then 2) the securing hardware module calculates the initialization vector iv_(j) with the aid of the relation iv_(j)=F_(iv)(@_(j)), where @_(j) is the address on the basis of which the code line has been loaded, and then 3) the securing hardware module decrypts the code line loaded with the aid of the initialization vector iv_(j) calculated to obtain: the datum D_(j) or its cryptogram, and the first error-detecting code, and then 4) the securing hardware module verifies, with the aid of the first error-detecting code obtained, whether there exists an error in the datum D_(j) or its cryptogram and, if such an error exists, triggers the signalling of an execution fault and, if such an error does not exist, inhibits this signalling of an execution fault.
 2. The method according to claim 1, wherein: during step a), the method comprises: the updating of a second error-detecting code as a function of the code line recorded at the address @_(j), this second error-detecting code making it possible to detect an error if any code line, contained in a block of several code lines recorded in a predetermined range of addresses of the main mem is modified after the updating of this second error-detecting code, the predetermined range of addresses comprising the address @_(j), and the recording of the updated second error-detecting code, just before or after the operation 1), the securing hardware module verifies, with the aid of the second error-detecting code updated during step a), whether there exists an error in the data block containing the code line recorded at the address @_(j), and, if such an error exists, triggers the signalling of an execution fault and, if such an error does not exist, inhibits this signalling of an execution fault.
 3. The method according to claim 2, wherein during step a): each code line of the data block contains, in addition to a datum or to its cryptogram, a message authentication code making it possible to verify the integrity and authenticity of the datum or of the cryptogram contained in this line, and the second error-detecting, code is updated solely with the aid of the message authentication codes of the code lines contained in this data block.
 4. The method according to claim 3, wherein: during, the operation a), the second error-detecting code is updated with the aid of the following relation: EDC_(m)=EDC_(m)XOR MAC_(jold) XOR MAC_(jnew), where: the symbols EDC_(m) on the right and on the left of the symbol “=” are, respectively, the preceding value and the updated value of the second error-detecting code, the symbol XOR is the “exclusive OR” operation, and the symbols MAC_(jold) and MAC_(jnew) are the values of the message authentication codes, respectively, of the old and of the new code lines recorded at the address @_(j).
 5. The method according to claim 2, wherein the updated second error-detecting code is recorded in a secure memory of the securing hardware module, this secure memory being only accessible by the securing hardware module.
 6. The method according to claim 1, wherein: during step a), the first error-detecting code is an error-correcting code which makes it possible in addition to correct an error in the datum D_(j) or in its cryptogam, during the operation 4), if an error exists, then the securing hardware module corrects the datum D_(j) or its cryptogram with the aid of the error-correcting code and then, the microprocessor processes the corrected datum D_(j) or its corrected cryptogram.
 7. The method according to claim 1, wherein during step a): the code line contains a cryptogram CD_(j)* of a concatenation CD_(j) of the datum D_(j) and of the first error-detecting code, this cryptogram CD_(j)* being obtained with the aid of a relation CD_(j)*=f_(ka)(CD_(j); iv_(j)), where the function f_(ka) is a predetermined encryption function corresponding to a decryption function f_(ka) ⁻¹ preprogrammed into the securing hardware module, the cryptogam CD_(j)* thus coding the datum D_(j) and the first error-detecting code as a function of the initialization vector iv_(j), during the operation 3), the decryption of the code line by the securing hardware module comprises the decryption of the cryptogram CD_(j)* with the aid of the relation CD_(j)=f_(ka) ⁻¹(CD_(j)*; iv_(j)) so as to obtain the decrypted datum D_(j) and the decrypted first error-detecting code.
 8. The method according to claim 1, wherein: during step a), the code line contains a cryptogram CD_(j)* constructed on the basis of the datum D_(j) and the first error-detecting code makes it possible to detect an error in the cryptogram CD_(j)*, this first error-detecting code or the cryptogram CD_(j)* being encrypted function of the initialization vector iv_(j), during the operation 3), the decryption of the code line by the securing hardware module comprises the decryption, with the aid of the initialization vector iv_(j) calculated, of the cryptogram CD_(j)* or of the first error-detecting code encrypted as a function of the initialization vector iv_(j).
 9. A non-transitory computer readable medium storing a binary code of a secure function executable by a microprocessor for the implementation of a method of execution in accordance with any one of the preceding claims, this binary code being recorded in the non-transitory computer readable medium in a main memory readable by the microprocessor, wherein the binary code comprises a code line containing: a datum D_(j) to be processed by the microprocessor, or a cryptogram of this datum D_(j), and a first error-detecting code making it possible to detect an error in the datum D_(j) or in its cryptogram if this datum D_(j) or its cryptogram is modified after its recording in the main memory, at least one of the datum D_(j), of its cryptogram and of the first error-detecting code being encrypted as a function of an initialization vector iv_(j), this initialization vector iv_(j) varying as a function of the address @_(j) at which the code line is recorded in the main memory according to a relation iv_(j)=F_(iv)(@_(j)), where the function F_(iv) is a function which associates a different initialization vector iv_(j) with each different address @_(j) of the main memory.
 10. (canceled)
 11. A microprocessor for the implementation of a method in accordance with claim 1, the microprocessor comprising: an arithmetic and logic circuit able to execute the operation 1) of the method in accordance with claim 1, and a securing hardware module, wherein the securing hardware module is configured to execute the operations 2) and 4) of the method.
 12. A compiler able to automatically transform a source code of a secure function into a binary code of this secure function, wherein the compiler is able to automatically transform the source code into a binary code in accordance with claim
 9. 